Implementing the branch-and-cut approach for a general purpose Benders’ decomposition framework

Benders’ decomposition is a popular mathematical and constraint programming algorithm that widely applied to exploit problem structure arising from real-world applications. While useful for exploiting in programs, the use of typically requires significant implementation effort achieve an effective solution algorithm. Traditionally, has been viewed as specific algorithm, which limited development general purpose algorithms software solutions. This paper presents capable handling many classes programs provides extensive flexibility this A branch-and-cut approach implemented within integer solver SCIP using plugin-based design allow wide variety extensions customisations The effectiveness available enhancement techniques assessed comprehensive computational study.